Engineering a Conformant Probabilistic Planner
نویسندگان
چکیده
We present a partial-order, conformant, probabilistic planner, Probapop which competed in the blind track of the Probabilistic Planning Competition in IPC-4. We explain how we adapt distance based heuristics for use with probabilistic domains. Probapop also incorporates heuristics based on probability of success. We explain the successes and difficulties encountered during the design and implementation of Probapop.
منابع مشابه
A Relevance-Based Compilation Method for Conformant Probabilistic Planning
Conformant probabilistic planning (CPP) differs from conformant planning (CP) by two key elements: the initial belief state is probabilistic, and the conformant plan must achieve the goal with probability ≥ θ, for some 0 < θ ≤ 1. In earlier work we observed that one can reduce CPP to CP by finding a set of initial states whose probability≥ θ, for which a conformant plan exists. In previous solv...
متن کاملA Compilation Based Approach to Conformant Probabilistic Planning with Stochastic Actions
We extend RBPP, the state-of-the-art, translation-based planner for conformant probabilistic planning (CPP) with deterministic actions, to handle a wide set of CPPs with stochastic actions. Our planner uses relevance analysis to divide a probabilistic ”failure-allowance” between the initial state and the stochastic actions. Using its ”initial-state allowance,” it uses relevance analysis to sele...
متن کاملProbapop: Probabilistic Partial-Order Planning
We describe Probapop, a partial-order probabilistic planning system. Probapop is a blind (conformant) planner that finds plans for domains involving probabilistic actions but no observability. The Probapop implementation is based on Vhpop, a partial-order deterministic planner written in C++. The Probapop algorithm uses plan graph based heuristics for selecting a plan from the search queue, and...
متن کاملPlanning in Incomplete Domains
Engineering complete planning domain descriptions is often very costly because of human-error or lack of domain knowledge. While many have studied knowledge acquisition, relatively few have studied the synthesis of plans when the domain model is incomplete (i.e., actions have incomplete preconditions or effects). Prior work has evaluated the correctness of plans synthesized by disregarding such...
متن کاملCost-Sensitive Reachability Heuristics for Probabilistic Planning
Reachability heuristics have lead to impressive scale-ups in deterministic planning making their application to probabilistic planning a promising research direction. We describe how one such reachability heuristic (based on planning graphs) can be extended to handle a class of cost-sensitive probabilistic planning problems. Specifically, we address the problem of conformant (non-observable) pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Artif. Intell. Res.
دوره 25 شماره
صفحات -
تاریخ انتشار 2006